Circular Coinductive Rewriting
نویسندگان
چکیده
Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our new BOBJ behavioral specification and computation system, which is used in examples throughout this paper. These examples demonstrate the surprising power of circular coinductive rewriting. The paper also sketches the underlying hidden algebraic theory and briefly describes BOBJ and some of its algorithms.
منابع مشابه
Conditional Circular Coinductive Rewriting with Case Analysis
We argue for an algorithmic approach to behavioral proofs, review the hidden algebra approach, develop circular coinductive rewriting for conditional goals, extend it with case analysis, and give some examples.
متن کاملWrla 2000 Preliminary Version Behavioral and Coinductive Rewriting
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including notions like termination and con uence. We describe an e cient implementation of behavioral rewriting that uses standard rewriting. Circular coinductive rewriting combines behavioral rewriting with circular coinduction, gi...
متن کاملCIRC : A Circular Coinductive Prover
CIRC is an automated circular coinductive prover implemented as an extension of Maude. The circular coinductive technique that forms the core of CIRC is discussed, together with a high-level implementation using metalevel capabilities of rewriting logic. To reflect the strength of CIRC in automatically proving behavioral properties, an example defining and proving properties about infinite stre...
متن کاملA Coinductive Treatment of Infinitary Rewriting
We present a coinductive treatment of infinitary term rewriting with reductions of arbitrary ordinal length. Our framework allows the following succinct definition of the infinitary rewrite relation → : → = μx. νy. (→ε ∪ x) ∗ ◦ y where R = { 〈f(s1, . . . , sn), f(t1, . . . , tn)〉 | s1 R t1, . . . , sn R tn } ∪ id and →ε are root steps. Here μ is the least fixed point operator and ν is the great...
متن کاملCoinductive Reasoning for Contextual Graph-Rewriting
We introduce a comprehensive semantic theory of graph rewriting. The theory is operational, and therefore, lends itself to the application of coinductive principles. The central idea is recasting rewriting frameworks as reactive systems with the resulting contextual equivalences. Specifically, a graph rewriting system is associated with a labelled transition system, so that the corresponding bi...
متن کامل